1

The strength of replacement in weak arithmetic

Cook, Stephen, Thapen, Neil
Journal:
ACM Transactions on Computational Logic
Année:
2006
Langue:
english
Fichier:
PDF, 200 KB
english, 2006
3

The polynomial and linear time hierarchies in V0

Leszek A. Kołodziejczyk, Neil Thapen
Journal:
Mathematical Logic Quarterly
Année:
2009
Langue:
english
Fichier:
PDF, 203 KB
english, 2009
4

Structures interpretable in models of bounded arithmetic

Neil Thapen
Journal:
Annals of Pure and Applied Logic
Année:
2005
Langue:
english
Fichier:
PDF, 270 KB
english, 2005
6

A model-theoretic characterization of the weak pigeonhole principle

Neil Thapen
Journal:
Annals of Pure and Applied Logic
Année:
2002
Langue:
english
Fichier:
PDF, 196 KB
english, 2002
7

Weak theories of linear algebra

Neil Thapen, Michael Soltys
Journal:
Archive for Mathematical Logic
Année:
2005
Langue:
english
Fichier:
PDF, 180 KB
english, 2005
8

Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem

Neil Thapen
Journal:
Archive for Mathematical Logic
Année:
2011
Langue:
english
Fichier:
PDF, 234 KB
english, 2011
9

Alternating minima and maxima, Nash equilibria and Bounded Arithmetic

Pavel Pudlák, Neil Thapen
Journal:
Annals of Pure and Applied Logic
Année:
2012
Langue:
english
Fichier:
PDF, 257 KB
english, 2012
10

How much randomness is needed for statistics?

Kjos-Hanssen, Bjørn, Taveneaux, Antoine, Thapen, Neil
Journal:
Annals of Pure and Applied Logic
Année:
2014
Langue:
english
Fichier:
PDF, 646 KB
english, 2014
11

NP Search Problems in Low Fragments of Bounded Arithmetic

Jan Krajíček, Alan Skelley and Neil Thapen
Journal:
Journal of Symbolic Logic
Année:
2007
Langue:
english
Fichier:
PDF, 2.03 MB
english, 2007
13

NP search problems in low fragments of bounded arithmetic

Krajíček, Jan, Skelley, Alan, Thapen, Neil
Journal:
Journal of Symbolic Logic
Année:
2007
Langue:
english
Fichier:
PDF, 1.63 MB
english, 2007
15

FRAGMENTS OF APPROXIMATE COUNTING

BUSS, SAMUEL R., KOŁODZIEJCZYK, LESZEK ALEKSANDER, THAPEN, NEIL
Journal:
Journal of Symbolic Logic
Année:
2014
Langue:
english
Fichier:
PDF, 459 KB
english, 2014
16

The Ordering Principle in a Fragment of Approximate Counting

Atserias, Albert, Thapen, Neil
Journal:
ACM Transactions on Computational Logic
Année:
2014
Langue:
english
Fichier:
PDF, 131 KB
english, 2014
17

Parity Games and Propositional Proofs

Beckmann, Arnold, Pudlák, Pavel, Thapen, Neil
Journal:
ACM Transactions on Computational Logic
Année:
2014
Langue:
english
Fichier:
PDF, 430 KB
english, 2014
18

Cobham recursive set functions

Beckmann, Arnold, Buss, Sam, Friedman, Sy-David, Müller, Moritz, Thapen, Neil
Journal:
Annals of Pure and Applied Logic
Année:
2016
Langue:
english
Fichier:
PDF, 678 KB
english, 2016
19

The complexity of proving that a graph is Ramsey

Lauria, Massimo, Pudlák, Pavel, Rödl, Vojtěch, Thapen, Neil
Journal:
Combinatorica
Année:
2017
Langue:
english
Fichier:
PDF, 398 KB
english, 2017
21

Space Complexity in Polynomial Calculus

Filmus, Yuval, Lauria, Massimo, Nordström, Jakob, Ron-Zewi, Noga, Thapen, Neil
Journal:
SIAM Journal on Computing
Année:
2015
Langue:
english
Fichier:
PDF, 409 KB
english, 2015
22

Total Space in Resolution

Bonacina, Ilario, Galesi, Nicola, Thapen, Neil
Journal:
SIAM Journal on Computing
Année:
2016
Langue:
english
Fichier:
PDF, 392 KB
english, 2016
23

On semantic cutting planes with very small coefficients

Lauria, Massimo, Thapen, Neil
Journal:
Information Processing Letters
Année:
2018
Langue:
english
Fichier:
PDF, 294 KB
english, 2018
24

Feasible set functions have small circuits

Beckmann, Arnold, Buss, Sam, Friedman, Sy-David, Müller, Moritz, Thapen, Neil
Journal:
Computability
Année:
2018
Langue:
english
Fichier:
PDF, 303 KB
english, 2018
25

Random resolution refutations

Pudlák, Pavel, Thapen, Neil
Journal:
Computational Complexity
Année:
2019
Langue:
english
Fichier:
PDF, 554 KB
english, 2019